Maneuverability Constraints for Design and Control of Robotic Systems: A Semi-Infinite Programming Approach

نویسنده

  • Timothy Joseph Graettinger
چکیده

This project report presents methods for determining maneuverability constraints for robotic systems. These maneuverability constraints are limits on the acceleration and velocity of the system specified in a global coordinate frame (e.g., a Cartesian reference frame where trajectory planning is typically done) based on torque/force and operating limits in a different reference frame (e.g., the manipulator joint angles where the system dynamics are more easily specified). We approach this problem of determining maneuverability constraints from an optimization perspective. The formulation as a mathematical program results in a generalized semi-infinite programming problem. An algorithm to solve the generalized semi-infinite programming problem is presented for the case when the objective function is a function of a single scalar variable. This algorithm is subsequently applied to two robotic manipulator applications. These examples illustrate the use of the maneuverability results for design and control of robotic systems. Acknowledgments I would like to sincerely thank my advisor Professor Bruce Krogh for the guidance and motivation he provided for me in the course of this work. The other members of the committee, Dr. C.P. Neuman and Dr. Mark Nagurka, also deserve much appreciation for their comments and suggestions. Finally, I would like to thank my family, relatives, and friends for their encouragement, smiles, and laughs that make life so much fun.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

A new solving approach for fuzzy multi-objective programming problem in uncertainty conditions by ‎using semi-infinite linear programing

In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...

متن کامل

Regularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz‎. ‎Necessary optimality conditions and regularity conditions are given‎. ‎Our approach are based on the Michel-Penot subdifferential.

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006